Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations
نویسندگان
چکیده
This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an extension and refinement of Prehofer’s higher-order narrowing calculus LN using the techniques developed in the refinement of a first-order lazy narrowing calculus LNC. HOLN is defined to deal with both unoriented and oriented equations. It keeps track of the variables which are to be bound to normalized answers. We discuss the operating principle of HOLN, its main properties, i.e. soundness and completeness, and its further refinements. The solving capability of HOLN is illustrated with an example of program calcula-
منابع مشابه
Refinements of Lazy Narrowing for Left-Linear Fully-Extended Pattern Rewrite Systems
Lazy narrowing is a general E-unification procedure for equational theories presented by confluent term rewriting systems. It has been deeply studied in the first order case and various higher-order extensions have been proposed in an attempt to improve its expressive power. Such extensions suffer from huge search space in guessing the solutions of variables of functional type. For practical pu...
متن کاملA Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature lack this feature. The natural way to deal with higher-order functions in the framework of ( rst-order) term rewriting is through so-called applicative term rewriting systems. In this paper we argue that existing calculi for lazy...
متن کاملA Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
We generalize the Constructor-based ReWriting Logic CRWL to the setting of the simply typed λ-calculus, where theories are presented by conditional overlapping fully extended pattern rewrite systems. We claim that this logic is useful for higher-order functional-logic programming, and propose a Higher-Order Lazy Narrowing calculus HOLNDT for answering joinability and reducibility queries, in wh...
متن کاملExtending the TOY System with the ECLiPSe Solver over Sets of Integers
Starting from a computational model for the cooperation of constraint domains in the CFLP context (with lazy evaluation and higher-order functions), we present the theoretical basis for the coordination domain C tailored to the cooperation of three pure domains: the domain of finite sets of integers (FS), the finite domain of integers (FD) and the Herbrand domain (H). We also present the adapta...
متن کاملCollaborative Constraint Functional Logic Programming System in an Open Environment
In this paper we describe collaborative constraint functional logic programming and the system called Open CFLP that supports this programming paradigm. The system solves equations by collaboration of various equational constraint solvers. The solvers include higher-order lazy narrowing calculi that serve as the interpreter of higher-order functional logic programming, and specialized solvers f...
متن کامل